Gossip-based Unstructured Overlay Networks: An Experimental Evaluation
نویسندگان
چکیده
Gossip-based protocols offer a scalable and reliable approach to a number of large-scale distributed applications. The basic idea is for each node to periodically select a random peer node to exchange information with. Analytical studies reveal a high reliability of gossip-based protocols. However, a usual assumption of these studies is that the peer is chosen uniformly at random from the set of all nodes. In practice—instead of requiring all nodes to know all the peer nodes— a scalable way to implement random peer selection is by constructing dynamic unstructured overlays through gossiping membership information itself. In this paper we generalize existing gossip-based overlays by introducing a general scheme in which existing overlays as well as novel protocols can be implemented. The central theme of this paper is exploring and comparing several implementations of our abstract scheme. Through extensive experimental analysis, we show that all of them lead to different communication topologies none of which is uniformly random. This clearly renders traditional theoretical approaches invalid. Our observations help explain important differences between design choices of a gossipbased protocol and how these impact the reliability of the overlay. Understanding these differences poses new interesting theoretical problems. . This work was partially supported by the Future & Emerging Technologies unit of the European Commission through Project BISON (IST-2001-38923). . University of Bologna, Italy . EPFL, Lausanne, Switzerland . Microsoft Research, Cambridge, UK . Vrije Universiteit, Amsterdam, The Netherlands
منابع مشابه
Gossip-Based Broadcast
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives on large scale peer-to-peer networks. Epidemic protocols are scalable because they distribute the load among all nodes in the system and resilient because they have an intrinsic level of redundancy that masks node and network failures. This chapter provides...
متن کاملA Topology Adaptation Protocol for Structured Superpeer Overlay Construction
Peer-to-peer networks can be divided into structured and unstructured based on their overlay topologies. In reality, unstructured p2p networks with superpeers have proved their capacities to support millions of users simultaneously. However, applications deployed on this kind of overlay networks, such as file-sharing, require flooding or gossip-based message routing, which puts more overhead on...
متن کاملHeal Gossip: A Secure Overlay for Unstructured P2P Networks
Gossip-based protocols are an e cient mechanism for man-aging pure unstructured peer-to-peer (P2P) networks. Such protocols are Newscast, Cyclone, Lbpcast, etc. They have overcome from several di culties of such P2P random overlay connection. Such difficulties are randomness, high churn rate, very large unstructured distributed net-work, etc. But the performance of all gossip-based protocols ha...
متن کاملGossiping for resource discovering: An analysis based on complex network theory
This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold by its neighbors. In particular, upon reception (or generation) of a novel query, a node relays the message to those neighbors that have resource...
متن کاملOn Adding Structure to Unstructured Overlay Networks
Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system....
متن کامل